On the optimal solution of interval linear complementarity problems
نویسندگان
چکیده
We consider compact intervals [a, a] := {x ∈ IR : a ≤ x ≤ a} and denote the set of all such intervals by IR. We also write [a] instead of [a, a]. Furthermore, we consider matrices with an interval in each of its elements; i.e., [A,A] = ([aij ]) = ([aij , aij ]). We also write [A,A] := {A ∈ IRn×n : A ≤ A ≤ A}. By IRn×n we denote the set of all these so-called interval matrices. We also write [A] instead of [A,A]. The set of interval vectors with n components is constructed in the same way and denoted by IR. For an introduction to interval computations we refer to [2]. Let [q] ∈ IR and [M ] ∈ IRn×n be given. Then, we are interested in the set
منابع مشابه
A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
A full Nesterov-Todd (NT) step infeasible interior-point algorithm is proposed for solving monotone linear complementarity problems over symmetric cones by using Euclidean Jordan algebra. Two types of full NT-steps are used, feasibility steps and centering steps. The algorithm starts from strictly feasible iterates of a perturbed problem, and, using the central path and feasi...
متن کاملNumerical validation of solutions of linear complementarity problems
This paper proposes a validation method for solutions of linear complementarity problems. The validation procedure consists of two sufficient conditions that can be tested on a digital computer. If the first condition is satisfied then a given multidimensional interval centered at an approximate solution of the problem is guaranteed to contain an exact solution. If the second condition is satis...
متن کاملA Survey on Different Solution Concepts in Multiobjective Linear Programming Problems with Interval Coefficients
Optimization problems have dedicated a branch of research to themselves for a long time ago. In this field, multiobjective programming has special importance. Since in most real-world multiobjective programming problems the possibility of determining the coefficients certainly is not existed, multiobjective linear programming problems with interval coefficients are investigated in this paper. C...
متن کاملImproved infeasible-interior-point algorithm for linear complementarity problems
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
متن کاملError Estimation for Nonlinear Complementarity Problems via Linear Systems with Interval Data
For the nonlinear complementarity problem we derive norm bounds for the error of an approximate solution, generalizing the known results for the linear case. Furthermore, we present a linear system with interval data, whose solution set contains the error of an approximate solution. We perform extensive numerical tests and compare the different approaches.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003